# -*- coding: UTF-8 -*-
from typing import List

from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def letterCombinations(self, digits: str) -> List[str]:
        dict = {
            2: "abc",
            3: 'def',
            4: 'ghi',
            5: 'jkl',
            6: 'mno',
            7: 'pqrs',
            8:  'tuv',
            9:  'wxyz'
        }
        ans = []

        for ch in digits:
            letters = dict[int(ch)]
            if letters:
                new_ans = []
                if len(ans) == 0:
                    for letter in letters:
                        ans.append(letter)
                else:
                    for item in ans:
                        for letter in letters:
                            new_ans.append(item + letter)
                    ans = new_ans

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ("23", ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"]),
        ("", []),
        ("2", ["a", "b", "c"])
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]
        exec_result = solution.letterCombinations(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect.sort(), exec_result.sort())
        TestcaseHelper.print_case(check_result, case_item, exec_result)

